A convex approximation for mixed-integer recourse models

We develop a convex approximation for two-stage mixed-integer recourse models and we derive an error bound for this approximation that depends on all total variations of the probability density functions of the random variables in the model. We show that the error bound converges to zero if all these total variations converge to zero. Our convex approximation is a generalization of the one in Chapter 4 restricted to totally unimodular integer recourse models. For this special case it has the best worst-case error bound possible. The error bound in this chapter is the first in the general setting of mixed-integer recourse models. As main building blocks in its derivation we generalize the asymptotic periodicity results of Gomory [29] for pure integer programs to the mixed-integer case, and we use the total variation error bounds on the expectation of periodic functions derived in Chapter 4. This chapter is submitted for publication as [59].